polynomial-like game

См. также в других словарях:

• mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

• Reed–Solomon error correction — Reed Solomon error correction is an error correcting code that works by oversampling a polynomial constructed from the data. The polynomial is evaluated at several points, and these values are sent or recorded. Sampling the polynomial more often… …   Wikipedia

• Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

• History of mathematics — A proof from Euclid s Elements, widely considered the most influential textbook of all time.[1] …   Wikipedia

• Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

• Generalized geography — In computational complexity theory, generalized geography is a problem that can be proven to be PSPACE Complete.IntroductionGeography is a childs game, which is good for a long car trip, where players take turns naming cities from anywhere in the …   Wikipedia

• P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

• Tetris — Tetяis redirects here. For the Tengen produced game, see TETЯIS: The Soviet Mind Game. Tetris The box of the Nintendo version of Tetris for the NES. Developer(s) Alexey Pajitnov (E60 prototype), Vadim Ge …   Wikipedia

• Voting system — For other uses, see Voting system (disambiguation). Part of the Politics series Electoral methods …   Wikipedia

• Nonogram — Not to be confused with Nonagram or Nomogram. Example of a nonogram puzzle being solved. The steps of the process are grouped together a bit. Nonograms, also known as Hanjie, Paint by Numbers, or Griddlers, are picture logic puzzles in which …   Wikipedia

• P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… …   Wikipedia